The graph grabbing game on {0,1}-weighted graphs
نویسندگان
چکیده
منابع مشابه
A Graph-Grabbing Game
Two players share a connected graph with non-negative weights on the vertices. They alternately take the vertices (one in each turn) and collect their weights. The rule they have to obey is that the remaining part of the graph must be connected after each move. We conjecture that the first player can get at least half of the weight of any tree with an even number of vertices. We provide a strat...
متن کاملA Graph Pebbling Algorithm on Weighted Graphs
A pebbling move on a weighted graph removes some pebbles at a vertex and adds one pebble at an adjacent vertex. The number of pebbles removed is the weight of the edge connecting the vertices. A vertex is reachable from a pebble distribution if it is possible to move a pebble to that vertex using pebbling moves. The pebbling number of a weighted graph is the smallest number m needed to guarante...
متن کاملOn the facility location problem: One-round weighted Voronoi game
Voronoi game presents a simple geometric model for Competitive facility location problems with two players. Voronoi game is played by two players known as White and Black, they play in a continuous arena. In the one-round game, White starts game and places all his points in the arena then Black places her points. Then the arena is divided by distance between two players and the player with the ...
متن کاملGraph Sharing Game and the Structure of Weighted Graphs with a Forbidden Subdivision
The graph sharing game is played by two players, Alice and Bob, on a connected graph G with non-negative weights assigned to the vertices. Starting with Alice, the players take the vertices of G one by one, in each move keeping the set of all taken vertices connected, until the whole G has been taken. Each player wants to maximize the total weight of the vertices they have gathered. It is prove...
متن کاملFrequent Sub-graph Mining on Edge Weighted Graphs
Frequent sub-graph mining entails two significant overheads. The first is concerned with candidate set generation. The second with isomorphism checking. These are also issues with respect to other forms of frequent pattern mining but are exacerbated in the context of frequent sub-graph mining. To reduced the search space, and address these twin overheads, a weighted approach to sub-graph mining...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Results in Applied Mathematics
سال: 2019
ISSN: 2590-0374
DOI: 10.1016/j.rinam.2019.100028